Learning rule ranking by dyn of context-free grammars usin
نویسنده
چکیده
This paper discusses a novel approach for the construction of a context-free grammar based on a sequential processing of sentences. The construction of the grammar is based on a search algorithm for the minimum weight subgraph in an AND/OR graph. Aspects of optimality and robustness are discussed. The algorithm plays an essential role in a model for adaptive learning of probabilistic ordering. The novelty in the proposed model is the combination of well-established methods from two different disciplines: graph theory and statistics. The set-up of this paper is mainly theoretical, and we follow a quite formal approach. There is a close link with Optimality Theory, one of the mainstream approaches in phonology, and with graph theory. The resulting techniques, however, can be applied in a more general domain.
منابع مشابه
Improving Grammar Learning Using Seed-Sets
Probabilistic Context-Free Grammars have been unsuccessful in learning natural language, due to the complexity of the task. Considerable research has been conducted into methods of reducing the complexity of PCFG learning. This paper reports the progress of work in extending one particular method of constraining PCFG learning providing partial grammars to improve rule generation. We discuss wha...
متن کاملRanking and Unranking Left Szilard Languages
We give efficient ranking and unranking algorithms for left Szilard languages of context-free grammars. If O(n2) time and space preprocessing is allowed then each ranking operation is possible in linear time. Unranking takes time O(n log n). These algorithms imply similar algorithms for context-free languages generated by arbitrary unambiguous context-free grammars.
متن کاملStochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search
We have previously used grammars as a formalism to structure a GA's search for program called sorting networks (SNets) [KBW95]. In this paper we restrict ourselves to stochastic context-free grammars which, while more analytically tracxtable than our SNet grammars, are more difficult than others previously considered by the GA community. In our approach: production rules of a grammar are encode...
متن کاملUsing Context-Free Grammars to Constrain Apriori-based Algorithms for Mining Temporal Association Rules
Algorithms for the inference of association with sequential information have been proposed and used but are ineffective, in some cases, because too many candidate rules are extracted. Filtering the relevant ones is usually difficult and inefficient. In this work, we present an algorithm for the inference of temporal association rules that uses context-free grammars to restrict the search proces...
متن کامل